zChaff: Modifications and Extensions
نویسنده
چکیده
The application of SAT solver in industrial verificationtools is mandatory for the successful analysis of prob-lems derived from hardware design, e.g. CombinationalEquivalence Checking (CEC) and Bounded Model Check-ing (BMC). In [8] Chaff, a new powerful SAT solver, waspresented that outperforms most of the existing publiclyavailable SAT solvers when applied to hard real-world prob-lems, e.g. from VLSI CAD. There are two versions avail-able of Chaff: mChaff and zChaff. Both are instancesof Chaff, but from the viewpoint of implementation they aretotally different since they were developped independentlyby M. Moskewicz (mChaff) and L. Zhang (zChaff). Inthis paper we concentrate on zChaff. We analyze the coreissues and propose modifications and extensions.
منابع مشابه
Tuning the VSIDS Decision Heuristic for Bounded Model Checking
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Problem) and more recently zchaff. In order to cope with very large hardware designs, our work exploited the unique characteristics of bounded model checking to enhance the SAT algorithms used to solve our problems. In our wor...
متن کاملCertification of SAT Solvers in Coq
We describe here a fully portable, open source certifier for traces of SAT problems produced by zChaff [6]. It can also be easily adapted for MiniSat [4], PicoSat [2] and Booleforce, which we have done for PicoSat. Our certifier has been developped with the proof assistant Coq. We give some figures based on the pigeon hole, comparing both PicoSat and zChaff on the one hand, and our certifier wi...
متن کاملNew Features of the SAT’04 versions of zChaff
Zchaff is an implementation of the well known Chaff algorithm [6]. It participated in the SAT 2002 Competition and won the Best Complete Solver in both industrial and handmade benchmark categories. It is a popular solver and can be compiled into a linkable library for easy integration with user applications. Successful integration examples include the BlackBox AI planner [1], NuSMV model checke...
متن کاملUsing Rewarding Mechanisms for Improving Branching Heuristics
The variable branching heuristics used in the most recent and most effective SAT solvers, including zChaff and BerkMin, can be viewed as consisting of a simple mechanism for rewarding the variables participating in conflicts during the search process. In this paper we propose to extend the simple rewarding mechanism used in zChaff and BerkMin, and develop different rewarding mechanisms based on...
متن کاملProtocol Modifications for the DNS Security Extensions
This document is part of a family of documents that describe the DNS Security Extensions (DNSSEC). The DNS Security Extensions are a collection of new resource records and protocol modifications that add data origin authentication and data integrity to the DNS. This document describes the DNSSEC protocol modifications. This document defines the concept of a signed zone, along with the requireme...
متن کامل